منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملSubcomplete Forcing and L-Forcing
ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...
متن کاملForcing Complexity: Minimum Sizes of Forcing Conditions
This note is a continuation of our former paper “Complexity of the r-query tautologies in the presence of a generic oracle” (Notre Dame J. Formal Logic 41 (2000)). We give a very short direct proof of the nonexistence of t-generic oracles, a result obtaind first by Dowd (Inform. and Comput. 96 (1992)). We also reconsitute a proof of Dowd’s result that the class of all r-generic oracles in his s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Fern Journal
سال: 2008
ISSN: 0002-8444,1938-422X
DOI: 10.1640/0002-8444(2008)98[47:fagoo]2.0.co;2